package top.wfzzq.ds;
/**
 * 测试递归算法
 * 
 * @author wanghui
 *
 */
public class RecursionDemo {
   public static void main(String[] args) {
	System.out.println(Recursion.factorial(5));
	System.out.println(Recursion.factorial(6));
	System.out.println(Recursion.factorial(20));
	System.out.println("================================");
	System.out.println(Recursion.rfactorial(5));
	System.out.println(Recursion.rfactorial(6));
	System.out.println(Recursion.rfactorial(20));
	System.out.println("================================");
//	System.out.println(Recursion.jiaogu(23, 23));
}
}
